Extending Action Language C+ by Formalizing Composite Actions

This paper extends action language C+ by introducing composite actions as sequential execution of primitive actions. Such extension leads to a more intuitive and flexible way to represent action domains, better exploit a general-purpose formalization, and improve the reasoning efficiency for large domains. The semantics of composite actions is defined by a translation to nonmonotonic causal theories. We implement the language by extending cplus2asp, which translates causal theories into answer set programming (ASP) and calls ASP solver.